Lecture 2: Magic Square Game and XOR Games
ثبت نشده
چکیده
Consider the 3×3 square consisting of nine variables x1,x2, . . . ,x9 as in Figure 2.1. The variables take values from {±1}. Each row and column corresponds to a constraint as follows. For the last column on the doubled line, the constraint is that the three variables of the column have product −1. For the other rows and columns with single lines, the constraints are that the variables on them have product 1. More explicitly, the constraints are
منابع مشابه
CS286.2 Lecture 15: Tsirelson’s characterization of XOR games
We first recall the notion of quantum multi-player games: a quantum k-player game involves a verifier V and k players P1, . . . , Pk. The verifier randomly picks an index i according to some distribution π over the set {1, . . . , Q} and sends a quantum state |φi〉 (the question) to the the players. Here |φi〉 consists of k quantum registers, |φi〉 = |φi〉P1···Pk , but it is not necessarily a produ...
متن کاملScribe: Thomas Vidick
In the past lecture we introduced 3-player variants of both the CHSH and Magic Square games. These have the property that, even though from the point of view of classical players the new games are exactly as hard as the 2-player variants (ω(CHSH2) = ω(CHSH3) and ω(MS2) = ω(MS3)), for quantum players the 3-player variants proved much more challenging: we showed ω∗(CHSH3) = ω(CHSH3) < ω∗(CHSH2) a...
متن کاملQuantum Strategies Are Better Than Classical in Almost Any XOR Game
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1− o(1) fraction of all 2-player XOR games.
متن کاملProvable Advantage for Quantum Strategies in Random Symmetric XOR Games
Non-local games are widely studied as a model to investigate the properties of quantum mechanics as opposed to classical mechanics. In this paper, we consider a subset of non-local games: symmetric XOR games of n players with 0-1 valued questions. For this class of games, each player receives an input bit and responds with an output bit without communicating to the other players. The winning co...
متن کاملLinear game non-contextuality and Bell inequalities—a graph-theoretic approach
We study the classical and quantumvalues of a class of oneand two-party unique games, that generalizes thewell-knownXORgames to the case of non-binary outcomes. In the bipartite case the generalizedXOR (XOR-d) gameswe study are a subclass of thewell-known linear games.We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-color...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014